Possible Degrees in Recursive Copies

نویسندگان

  • Christopher J. Ash
  • Julia F. Knight
چکیده

Let A be a recursive structure, and let R be a recursive relation on A. Harizanov ( 1991) isolated a syntactical condition which (with additional effectiveness conditions) is necessary and sufficient for A to have recursive copies in which the image of R is r.e. of arbitrary te. degree. We had conjectured that a certain extension of Harizanov’s syntactical condition would (with some effectiveness conditions) be necessary and sufficient for A to have recursive copies in which the image of R is Pa of arbitrary z”, degree, but this is not the case. Here we give examples illustrating some restrictions on the possible Pa degrees. In these examples, the image of R cannot be z”, of degree d unless d possesses an “a-table” (a sequence of sets in which each one is r.e. in and above the earlier ones).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degrees in $k$-minimal label random recursive trees

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring

متن کامل

Limit distribution of the degrees in scaled attachment random recursive trees

We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...

متن کامل

Finite Computable Dimension and Degrees of Categoricity

We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below 0′′, and not above 0′. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form [0(α),0(α+ 1)] for any computable ordinal α. We t...

متن کامل

Degrees of Recursively Saturated Models

Using relativizations of results of Goncharov and Peretyat'kin on decidable homogeneous models, we prove that if M is S-saturated for some Scott set S, and F is an enumeration of S, then M has a presentation recursive in F. Applying this result we are able to classify degrees coding (i) the reducts of models of PA to addition or multiplication, (ii) internally finite initial segments and (iii) ...

متن کامل

Effect of storage conditions of dried plasma and blood spots on HIV-1 RNA quantification and PCR amplification for drug resistance genotyping.

OBJECTIVES Dried blood spots (DBS) and dried plasma spots (DPS) are easy to collect and store, and have been successfully tested as an alternative to plasma for performing virological analyses. Adequate storage conditions still need to be established and cell-associated proviral DNA in DBS can contribute to the amplified products. We evaluated these two parameters. METHODS Residual samples fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 75  شماره 

صفحات  -

تاریخ انتشار 1995